Lower Bounds for Clear Transmissions in Radio Networks
نویسندگان
چکیده
We show new lower bounds for collision-free transmissions in Radio Networks. Our main result is a tight lower bound of Ω(log n log(1/ )) on the time required by a uniform randomized protocol to achieve a clear transmission with success probability 1 − in a one-hop setting. This result is extended to non-uniform protocols as well. A new lower bound is proved for the important multi-hop setting of nodes distributed as a connected Random Geometric Graph. Our main result is tight for a variety of problems.
منابع مشابه
Algorithms and Lp-duality Based Lower Bounds in Ad-hoc Radio Networks by Rohan Jude Fernandes
OF THE DISSERTATION Algorithms and LP-Duality Based Lower Bounds in Ad-hoc Radio Networks by Rohan Jude Fernandes Dissertation Director: Mart́ın Farach-Colton An Ad-hoc Radio Network consists of nodes with no knowledge of its neighbors and knowledge of its own ID and n, the size of the network. In this thesis, we present algorithms and lower bounds related to ad-hoc network initialization. Senso...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملEfficient Gathering in Radio Grids with Interference†
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT and there is no interference from other transmissions. One transmission interferes with the reception of another transmission if the sender of the first transmission is at distance dI or less from th...
متن کاملDeterministic recurrent communication in restricted Sensor Networks
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisions of transmissions. However, the scarcest resource in this setting is the energy supply, and radio communication dominates the sensor node energy consumption. Hence, redundant trials of transmission as used in randomi...
متن کاملHow Hard is Computing Parity with Noisy Communications?
We show a tight lower bound of Ω(N log logN) on the number of transmissions required to compute the parity of N input bits with constant error in a noisy communication network of N randomly placed sensors, each having one input bit and communicating with others using local transmissions with power near the connectivity threshold. This result settles the lower bound question left open by Ying, S...
متن کامل